Computing level one Hecke eigensystems (mod )

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ALL SIEGEL HECKE EIGENSYSTEMS ( MOD p ) ARE CUSPIDAL

Fix integers g ≥ 1 and N ≥ 3, and a prime p not dividing N . We show that the systems of Hecke eigenvalues occurring in the spaces of Siegel modular forms (mod p) of dimension g, level N , and varying weight, are the same as the systems occurring in the spaces of Siegel cusp forms with the same parameters and varying weight. In particular, in the case g = 1, this says that the Hecke eigensystem...

متن کامل

Computing Mod Without Mod

Encryption algorithms are designed to be difficult to break without knowledge of the secrets or keys. To achieve this, the algorithms require the keys to be large, with some algorithms having a recommend size of 2048-bits or more. However most modern processors only support computation on 64-bits at a time. Therefore standard operations with large numbers are more complicated to implement. One ...

متن کامل

The Eichler-Selberg Trace Formula for Level-One Hecke Operators

This paper explains the steps involved in the proof of the Eichler-Selberg Trace Formula for Hecke operators of level one. It is based on an appendix in Serge Lang’s Introduction to Modular Forms written by Don Zagier, though I also draw heavily from sections of Toshitsune Miyake’s Modular Forms and Xueli Wang’s and Dingyi Pei’sModular Forms with Integral and Half-Integral Weights. Section 2 su...

متن کامل

Density-Weighted Nyström Method for Computing Large Kernel Eigensystems

The Nyström method is a well-known sampling-based technique for approximating the eigensystem of large kernel matrices. However, the chosen samples in the Nyström method are all assumed to be of equal importance, which deviates from the integral equation that defines the kernel eigenfunctions. Motivated by this observation, we extend the Nyström method to a more general, density-weighted versio...

متن کامل

COMPUTING WITH HECKE GRÖSSENCHARACTERS by

— We describe how to compute with algebraic Hecke Grössencharacters. We first describe Dirichlet characters on number field elements, and finite order Hecke characters on ideals, before passing to the general case. Our primary interest is not directly in the characters themselves, but rather in their L-functions, and particularly the special values of these. We avoid the adelic language, since ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: LMS Journal of Computation and Mathematics

سال: 2013

ISSN: 1461-1570

DOI: 10.1112/s1461157013000132